#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

struct TreeNode
{
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

//二叉树的深度
int TreeDepth(TreeNode *pRoot)
{
    if (!pRoot)
    {
        return 0;
    }
    return 1 + max(TreeDepth(pRoot->left), TreeDepth(pRoot->right));
}

void test()
{
}

int main()
{
    test();
    return 0;
}